Corrigendum to “The orthogonal colouring game” [Theor. Comput. Sci. 795 (2019) 312–325]
نویسندگان
چکیده
منابع مشابه
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]
Proofs of Propositions 6 and 8 of the paper Communication Complexity and Intrinsic Universality in Cellular Automata are formally incorrect. This erratum proves weaker versions of Propositions 6 and 8 and a stronger version of Proposition 9which are sufficient to get the main results of the paper (Corollary 2) for PREDICTION and INVASION problems. For problem CYCLE, we only prove a weaker versi...
متن کاملCorrigendum to "Shifting: One-inclusion mistake bounds and sample compression" [J. Comput. System Sci 75 (1) (2009) 37-59]
Article history: Received 8 February 2010 Available online 11 March 2010 H. Simon and B. Szörényi have found an error in the proof of Theorem 52 of “Shifting: One-inclusion mistake bounds and sample compression”, Rubinstein et al. (2009) [3]. In this note we provide a corrected proof of a slightly weakened version of this theorem. Our new bound on the density of one-inclusion hypergraphs is aga...
متن کاملGame Colouring Directed Graphs
In this paper, a colouring game and two versions of marking games (the weak and the strong) on digraphs are studied. We introduce the weak game chromatic number χwg(D) and the weak game colouring number wgcol(D) of digraphs D. It is proved that if D is an oriented planar graph, then χwg(D) 6 wgcol(D) 6 9, and if D is an oriented outerplanar graph, then χwg(D) 6 wgcol(D) 6 4. Then we study the s...
متن کاملComput Syst Sci & Eng (2007) 4: 179-191
Online auctions have become a quite popular and effective approach in the Internet-based eMarketplace. Howev where multiple auctions for identical items are running simultaneously, bidding behaviors become very complic Consequently, a shill bidder can easily disguise himself as a legitimate user in order to drive up the bidding price. T an efficient formal approach to verifying certain bidding ...
متن کاملErratum to "The computational power of Benenson automata" [Theoret. Comput. Sci. 344 (2005) 279-297]
We erroneously claim that Lemma 5.1 applies to both non-deterministic and deterministic Benenson automata, while it applies only to deterministic ones. The following corrected lemma holds for both deterministic and non-deterministic Benenson automata. It also exponentially improves on the dependence on D for both for circuit depth and size compared to the paper version. Note that compared with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.12.007